Search results
From MaRDI portal
- Publication Date of Publication Type Quasi-realtime languages (Extended Abstract) 2014-03-14 Paper Formal Languages: Origins and Directions 2002-11-25 Paper https://portal...10 bytes (18 words) - 22:56, 12 December 2023
- ions on basic families of formal languages 2024-03-28 Paper A time to cast away stones 2024-02-28 Paper On hardest languages for one-dimensional cellular...10 bytes (17 words) - 09:17, 25 September 2023
- Abstract Interpretation 2007-02-12 Paper Formal Modeling and Analysis of Timed Systems 2006-11-14 Paper Formal Modeling and Analysis of Timed Systems 2006-11-14...10 bytes (19 words) - 16:50, 9 December 2023
- Keywords formal grammars; formal language theory; finite transducers; inverse homomorphisms; grammars with context operators; hardest formal languages Mathematics...15 bytes (64 words) - 17:15, 25 April 2024
- Keywords context-free languages; data storage; pushdown automata; abstract family of languages; nondeterministic automata; hardest languages; regular set of...15 bytes (51 words) - 23:00, 3 February 2024
- automata; Greibach's theorem; hardest context-free language Mathematics Subject Classification ID 68Q45: Formal languages and automata...15 bytes (27 words) - 23:53, 5 February 2024
- zbMATH Keywords formal languages; associative descriptions; local testability Mathematics Subject Classification ID 68Q45: Formal languages and automata Cites...15 bytes (97 words) - 02:24, 30 January 2024
- Keywords Shannon effect; hardest finite languages; non-uniform measures Mathematics Subject Classification ID 68Q45: Formal languages and automata 03D15: Complexity...15 bytes (66 words) - 17:19, 5 February 2024
- conjunctive grammar; Boolean grammar; hardest language Mathematics Subject Classification ID 68Q45: Formal languages and automata 68Q42: Grammars and rewriting...15 bytes (63 words) - 07:44, 1 February 2024
- zbMATH Keywords groupoid; context-free languages Mathematics Subject Classification ID 68Q45: Formal languages and automata Cites Work \(NC^ 1\): The automata-theoretic...15 bytes (111 words) - 10:52, 31 January 2024
- On the Tape Complexity of Deterministic Context-Free Languages The Hardest Context-Free Language Finite-Turn Pushdown Automata On the Length of Programs...15 bytes (144 words) - 06:23, 31 January 2024
- recursive languages; finite-state automata; Chomsky hierarchy; pushdown automata; continuations; context-sensitive languages; context- free language; left-associative...15 bytes (137 words) - 07:10, 31 January 2024
- control: The relation between ITNC vector languages and rational relations The Hardest Context-Free Language...15 bytes (139 words) - 16:56, 31 January 2024
- nondeterministic finite automaton Mathematics Subject Classification ID 68Q45: Formal languages and automata Cites Work Unnamed Item Unnamed Item Unnamed Item Unnamed...15 bytes (218 words) - 01:56, 30 January 2024
