On a subclass of -regular languages
From MaRDI portal
Publication:1104761
DOI10.1016/0304-3975(88)90105-3zbMATH Open0647.68075OpenAlexW112693406MaRDI QIDQ1104761FDOQ1104761
Authors: Ivan Mezník 
Publication date: 1988
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(88)90105-3
Recommendations
- Regular Growth Automata: Properties of a Class of Finitely Induced Infinite Machines
- scientific article; zbMATH DE number 940749
- P Finite Automata and Regular Languages over Countably Infinite Alphabets
- \(\mathcal{PS}\)-regular languages
- Classes of regular and context-free languages over countably infinite alphabets
Cites Work
- Title not available (Why is that?)
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Testing and generating infinite sequences by a finite automaton
- Theories of automata on \(\omega\)-tapes: a simplified approach
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fixed-point characterization of context-free ∞-languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sets constructed by acceptors
- Title not available (Why is that?)
- Generable sets
- G-machines and generable sets
Cited In (7)
- An algebraic characterization of deterministic regular languages over infinite alphabets.
- Non-regular Maximal Prefix-Free Subsets of Regular Languages
- Title not available (Why is that?)
- A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions
- Regular Growth Automata: Properties of a Class of Finitely Induced Infinite Machines
- Classes of regular and context-free languages over countably infinite alphabets
- On the power of subroutines for finite state machines
This page was built for publication: On a subclass of \(\infty\)-regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104761)
