Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Xavier Augros
Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set
CIAA, 1998.

WIA 1998
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{WIA-1998-Augros,
	author        = "Xavier Augros",
	booktitle     = "{Revised Papers of the Third International Workshop on Implementing Automata}",
	doi           = "10.1007/3-540-48057-9_20",
	isbn          = "3-540-66652-4",
	pages         = "220--225",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set}",
	volume        = 1660,
	year          = 1998,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.