✦ LIBER ✦

Computability by finite automata and pisot bases

✍ Scribed by Daniel Berend; Christiane Frougny

Publisher: Springer
Year: 1994
Tongue: English
Weight: 372 KB
Volume: 27
Category: Article
ISSN: 1433-0490
DOI: 10.1007/bf01578846

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A compiler-based toolkit to teach and le

A compiler-based toolkit to teach and learn finite automata

✍ Pinaki Chakraborty; P. C. Saxena; C. P. Katti 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 239 KB 👁 1 views

Bounded quantification and relations rec

Bounded quantification and relations recognizable by finite automata

✍ Teuvo Laurinolli 📂 Article 📅 1978 🏛 Springer-Verlag 🌐 English ⚖ 578 KB

On the base-dependence of sets of number

On the base-dependence of sets of numbers recognizable by finite automata

✍ Alan Cobham 📂 Article 📅 1969 🏛 Springer 🌐 English ⚖ 546 KB

On the Languages Representable by Finite

On the Languages Representable by Finite Probabilistic Automata

✍ Phan Dinh Diêu 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 837 KB

Errata to: “Finite Automata and Unary La

Errata to: “Finite Automata and Unary Languages”: [Theoret. Comput. Sci. 47 (1986) 149–158]

✍ Marek Chrobak 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 146 KB

In [1], I presented several results on the state complexity of di erent types of ÿnite automata for unary languages. The following function F : N → N plays a crucial role in that paper:

Concise representations of regular langu

Concise representations of regular languages by degree and probabilistic finite automata

✍ Chandra M. R. Kintala; Kong -Yee Pun; Detlef Wotschke 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 744 KB